Extended Nested Dual System Groups, Revisited

نویسندگان

  • Junqing Gong
  • Jie Chen
  • Xiaolei Dong
  • Zhenfu Cao
  • Shaohua Tang
چکیده

The notion of extended nested dual system groups (ENDSG) was recently proposed by Hofheinz et al. [PKC 2015] for constructing almost-tight identity based encryptions (IBE) in the multi-instance, multi-ciphertext (MIMC) setting. However only a composite-order instantiation was proposed and more efficient prime-order instantiations are absent. The paper fills the blank by presenting two constructions. We revise the definition of ENDSG and realize it using prime-order bilinear groups based on Chen and Wee’s prime-order instantiation of nested dual system groups [CRYPTO 2013]. This yields the first almosttight IBE in the prime-order setting achieving weak adaptive security in MIMC scenario under the d-linear (d-Lin) assumption. We further enhanced the revised ENDSG to capture stronger security notions for IBE, including B-weak adaptive security and full adaptive security. We show that our prime-order instantiation is readily B-weak adaptive secure and full adaptive secure without introducing extra assumption. We then try to find better solution by fine-tuning ENDSG again and realizing it using the technique of Chen, Gay, and Wee [EUROCRYPT 2015]. This leads to an almost-tight secure IBE in the same setting with better performance than our first result, but the security relies on a non-standard assumption, d-linear assumption with auxiliary input (d-LinAI) for an even positive integer d. However we note that, the 2-LinAI assumption is implied by the external decisional linear (XDLIN) assumption. This concrete instantiation could also be realized using symmetric bilinear groups under standard decisional linear assumption.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Integrated Model for Storage Location Assignment and Storage/Retrieval Scheduling in AS/RS system

An integrated optimization framework, including location assignment under grouping class-based storage policy and schedule of dual shuttle cranes, is offered by presenting a new optimization programming model. The objective functions, which are considered at this level, are the minimization of total costs and energy consumption. Scheduling of dual shuttle cranes among specified locations, which...

متن کامل

Petrie-Coxeter Maps Revisited

This paper presents a technique for constructing new chiral or regular polyhedra (or maps) from self-dual abstract chiral polytopes of rank 4. From improperly self-dual chiral polytopes we derive “Petrie-Coxeter-type” polyhedra (abstract chiral analogues of the classical Petrie-Coxeter polyhedra) and investigate their groups of automorphisms.

متن کامل

The Effect of System-Nested, Genre-Oriented, Structurally-Mediated Model (SGSM) of Writing Instruction, and Swalesian Model (SM) upon Iranian Learners’ Writing Performance: A Comparative Study

The purpose of the present study was first to offer a tentative solution to the problems observed in writing pedagogy in Iran by devising a more comprehensive approach to genre-based writing instruction. In the second phase, a quasi-experimental research design was adopted to determine how effective the model was in writing instruction, compared with the traditional, product-oriented approach, ...

متن کامل

Approximate Range Counting Revisited

We study range-searching for colored objects, where one has to count (approximately) the number of colors present in a query range. The problems studied mostly involve orthogonal rangesearching in two and three dimensions, and the dual setting of rectangle stabbing by points. We present optimal and near-optimal solutions for these problems. Most of the results are obtained via reductions to the...

متن کامل

Nested Loops Revisited

The research community has considered hash-based parallel join algorithms the algorithms of choice for almost a decade. However, almost none of the commercial parallel database systems use hashing-based join algorithms, using instead nested-loops with index or sort-merge. While the research literature abounds with comparisons between the various hash-based and sort-merge join algorithms, to our...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015